An ore-type condition implying a digraph to be pancyclic
نویسندگان
چکیده
منابع مشابه
Some panconnected and pancyclic properties of graphs with a local ore-type condition
Asratian and Khachatrian proved that a connected graph G of order at least 3 is hamiltonian if d(u) + d(v);;::: JN(u) U N(v) U N.(w)I for any path uwv with uv ff E(G), .where N(x) is the neighborhood of a vertex x. We prove that a graph G with this condition, which is not complete bipartite, has the following properties: a) For each pair of vertices x, y with distance d(x, y) 2:: 3 and for each...
متن کاملA New Sufficient Condition for a Digraph to Be Hamiltonian
In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...
متن کاملAn Ore-type Condition for Cyclability
Let G = (V (G), E(G)) be a finite simple graph without loops. The neighbourhood N (v) of a vertex v is the set of vertices adjacent to v. The degree d(v) of v is |N (v)|. The minimum and maximum degree of G are denoted by δ(G) and 1(G), respectively. For a vertex v ∈ V (G) and a subset S ⊆ V (G), NS(v) is the set of neighbours of v contained in S, i.e., NS(v) = N (v) ∩ S. We let dS(v) = |NS(v)|...
متن کاملA Forbidden Subdigraph Condition Implying an Oriented Graph to Be Hamiltonian
In this note we prove that a strong oriented graph of order at least 3 without containing an induced subdigraph of a set of seven 4?order oriented graphs is Hamiltonian. We apply a technique introduced by Bondy and Thomassen.
متن کاملOre-type conditions implying 2-factors consisting of short cycles
For every graph G, let σ2(G) = min{d(x)+ d(y) : xy 6∈ E(G)}. The main result of the paper says that everyn-vertex graphGwithσ2(G) ≥ 4n 3 −1 contains each spanning subgraphH all whose components are isomorphic to graphs in {K1, K2, C3, K 4 , C + 5 }. This generalizes the earlier results of Justesen, Enomoto, andWang, and is a step towards an Ore-type analogue of the Bollobás–Eldridge–Catlin Conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90122-4